A Super-Grover Separation Between Randomized and Quantum Query Complexities
نویسنده
چکیده
We construct a total Boolean function f satisfying R(f) = Ω̃(Q(f)), refuting the long-standing conjecture that R(f) = O(Q(f)) for all total Boolean functions. Assuming a conjecture of Aaronson and Ambainis about optimal quantum speedups for partial functions, we improve this to R(f) = Ω̃(Q(f)). Our construction is motivated by the Göös-Pitassi-Watson function but does not use it.
منابع مشابه
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
This paper considers the query complexity of the functions in the family FN,M of N -variable Boolean functions with onset size M , i.e., the number of inputs for which the function value is 1, where 1 ≤ M ≤ 2N/2 is assumed without loss of generality because of the symmetry of function values, 0 and 1. Our main results are as follows: • There is a super-linear gap between the average-case and wo...
متن کاملForrelation: A Problem That Optimally Separates Quantum from Classical Computing Citation
We achieve essentially the largest possible separation between quantum and classical query complexities. We do so using a property-testing problem called Forrelation, where one needs to decide whether one Boolean function is highly correlated with the Fourier transform of a second function. This problem can be solved using 1 quantum query, yet we show that any randomized algorithm needs Ω( √ N/...
متن کاملOptimal Separation in Exact Query Complexities for Simon's Problem
Simon’s problem is one of the most important problems demonstrating the power of quantum computers, which achieves a large separation between quantum and classical query complexities. However, Simon’s discussion on his problem was limited to bounded-error setting, which means his algorithm can not always get the correct answer. Exact quantum algorithms for Simon’s problem have also been propose...
متن کاملThe Zero-Error Randomized Query Complexity of the Pointer Function
The pointer function of Göös, Pitassi and Watson [5] and its variants have recently been used to prove separation results among various measures of complexity such as deterministic, randomized and quantum query complexities, exact and approximate polynomial degrees, etc. In particular, the widest possible (quadratic) separations between deterministic and zero-error randomized query complexity, ...
متن کاملLow-Sensitivity Functions from Unambiguous Certificates
We provide new query complexity separations against sensitivity for total Boolean functions: a power 3 separation between deterministic (and even randomized or quantum) query complexity and sensitivity, and a power 2.1 separation between certificate complexity and sensitivity. We get these separations by using a new connection between sensitivity and a seemingly unrelated measure called one-sid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 22 شماره
صفحات -
تاریخ انتشار 2015